Adapted Branch-and-Bound Algorithm Using SVM With Model Selection
نویسندگان
چکیده
منابع مشابه
Fast Branch & Bound Algorithm in Feature Selection
We introduce a novel algorithm for optimal subset selection. Due to its simple mechanism for predicting criterion values the algorithm finds optimum usually several times faster than any other known Branch & Bound [5], [7] algorithm. This behavior is expected when the algorithm is used in conjunction with non-recursive and/or computationally expensive criterion functions.
متن کاملA Recursive Branch and Bound Algorithm for Feature Selection
Feature selection is a basic problem in pattern recognition application. The branch and bound (BB) algorithm is the only feature selection algorithm that provides global optimal results. All BB algorithms in literature are currently nonrecursive algorithms, and their corresponding program code is highly complex. In this study, a recursive BB algorithm, which is easy to program and debug, is des...
متن کاملBranch and Bound Algorithm Selection by Performance Prediction
We propose a method called Selection by Performance Prediction (SPP) which allows one, when faced with a particular problem instance, to select a Branch and Bound algorithm from among several promising ones. This method is based on Knuth’s sampling method which estimates the efficiency of a backtrack program on a particular instance by iteratively generating random paths in the search tree. We ...
متن کاملA Distance-Based Branch and Bound Feature Selection Algorithm
There is no known efficient method for selecting k Gaussian features from n which achieve the lowest Bayesian classification error. We show an example of how greedy algorithms faced with this task are led to give results that are not optimal. This motivates us to propose a more robust approach. We present a Branch and Bound algorithm for finding a subset of k independent Gaussian features which...
متن کاملAn improved branch and bound algorithm for feature selection
Feature selection plays an important role in pattern classification. In this paper, we present an improved Branch and Bound algorithm for optimal feature subset selection. This algorithm searches for an optimal solution in a large solution tree in an efficient manner by cutting unnecessary paths which are guaranteed not to contain the optimal solution. Our experimental results demonstrate the e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Electrical and Computer Engineering (IJECE)
سال: 2019
ISSN: 2088-8708,2088-8708
DOI: 10.11591/ijece.v9i4.pp2481-2490